Distributed algorithm for approximating the maximum matching
نویسندگان
چکیده
منابع مشابه
Distributed algorithm for approximating the maximum matching
We present a distributed algorithm that finds a matching M of size which is at least 2/3|M | where M ∗ is a maximum matching in a graph. The algorithm runs in O(log n) steps.
متن کاملA Fast Distributed Algorithm for Approximating the Maximum Matching
We present a distributed approximation algorithm that computes in every graph G a matching M of size at least 2 3 β(G), where β(G) is the size of a maximum matching in G. The algorithm runs in O(log |V (G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in the same protocol. This improves the run...
متن کاملPrinciples of Distributed Computing 1 Approximating Maximum Matching
In this lecture, we discuss sublinear-time centralized algorithms for graph problems. As we shall see soon, the core part of these algorithms is a local procedure, quite similar to the LOCAL distributed algorithms that we have been discussing over the past few lectures. Sublinear-time (centralized) algorithms are gaining importance with the constant increase in the size of the graph problems th...
متن کاملDistributed Algorithm for Better Approximation of the Maximum Matching
Let G be a graph on n vertices that does not have odd cycles of lengths 3, . . . , 2k− 1 with k ≥ 2. We give a deterministic distributed algorithm which finds in a poly-logarithmic (in n) number of rounds a matching M , such that |M | ≥ (1−α)m(G), where m(G) is the size of a maximum matching in G and α = 1 k+1 .
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.10.004